Modeling of Packet Interactions in Dispersion-Based Network Probing Schemes

نویسندگان

  • Andreas Johnsson
  • Bob Melander
  • Mats Björkman
چکیده

Measurements of end-to-end available bandwidth is getting increasingly important in the Internet. Many measurement methods are based on analysis of the dispersion of probe packets that have traversed the network according to some probing scheme. In this paper we present a theoretical framework to model interactions, at the discrete packet level, between probe packets and cross-traffic packets for dispersion-based probing schemes. We believe that an understanding of packet interactions is crucial to develop accurate and efficient measurement methods as well as to evaluate trade-offs between different probing schemes. Using the framework, we show that for statistical metrics such as the mean there are significant differences between using packet-pair and packet-train probing schemes when subject to cross traffic. Hence, these two probing schemes should not be used interchangabely. We show that the differences between packet-pair and packet-train probing schemes are due to correlations of dispersion values obtained from packet train probing. These correlations do not arise in packet-pair probing. The correlations are manifested as three characteristic patterns. The correlations and their corresponding patterns are identified and analyzed within our framework.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Analysis of Packet-Train Probing Schemes

With a better understanding of how probe packets and cross-traffic packets interact with each other, more accurate measurement methods based on active probing can be developed. Several existing measurement methods rely on packet-train probing schemes. In this article, we study and describe the interactions between probe packets and cross-traffic packets. When one packet within a packet train is...

متن کامل

Cross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness

This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...

متن کامل

Modeling of VANET Technology & Ad-Hoc Routing Protocols Based on High Performance Random Waypoint Models

Today, one of the new technologies in the modern era is Vehicular Ad-hoc Network which has takenenormous attention in the recent years. Because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called V2V orvehicle to vehicle communication and vehicle to roadside infrastructure, called V2I. Designin...

متن کامل

M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...

متن کامل

Packet-Pair Flow Control

This paper presents the packet-pair rate-based feedback flow control scheme. This scheme is designed for networks where individual connections do not reserve bandwidth and for the available bitrate (best-effort) component of integrated networks. We assume a round-robin-like queue service discipline in the output queues of the network’s switches, and propose a linear stochastic model for a singl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007